The expressiveness of locally stratified programs
نویسندگان
چکیده
منابع مشابه
Transformation Rules for Locally Stratified Constraint Logic Programs
We propose a set of transformation rules for constraint logic programs with negation. We assume that every program is locally stratified and, thus, it has a unique perfect model. We give sufficient conditions which ensure that the proposed set of transformation rules preserves the perfect model of the programs. Our rules extend in some respects the rules for logic programs and constraint logic ...
متن کاملLocally Stratified Boolean Grammars
Article history: Received 29 June 2007 Revised 16 February 2008 Available online 7 June 2008 We introduce locally stratified Boolean grammars, a natural subclass of Boolean grammars with many desirable properties. Informally, if a grammar is locally stratified then the set of all pairs of the form (nonterminal, string) of the grammar can be mapped to a (possibly infinite) set of strata so as th...
متن کاملStratified disks are locally stable
Notwithstanding recent claims by Richard et al., there is no linear hydrodynamic instability of axisymmetrically stable disks in the local limit. We prove this by means of an exact stability analysis of an unbounded incompressible flow having constant stratification and constant shear.
متن کاملMultiplier Ideals of Stratified Locally Conical Divisors
We prove a formula for the multiplier ideals of stratified locally conical divisors, generalizing a formula of Mustata for a hyperplane arrangement with a reduced equation. We also give a partial converse to a result of Ein, Lazarsfeld, Smith, and Varolin on the relation between the jumping coefficients and the roots of the Bernstein-Sato polynomial.
متن کاملExpressing and Supporting Efficiently Greedy Algorithms as Locally Stratified Logic Programs
The problem of expressing and supporting classical greedy algorithms in Datalog has been the focus of many signi cant research e orts that have produced very interesting solutions for particular algorithms. But we still lack a general treatment that characterizes the relationship of greedy algorithms to non-monotonic theories and leads to asymptotically optimal implementations. In this paper, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 1995
ISSN: 1012-2443,1573-7470
DOI: 10.1007/bf01534455